An Approximation Scheme for Planar Graph TSP
نویسندگان
چکیده
We consider the special case of the traveling salesman problem (TSP) in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial-time approximation scheme (PTAS) for this problem.
منابع مشابه
Grigni: [8] An Approximation Scheme for Planar Graph TSP
We consider the special case of the traveling salesman problem (TSP) in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial-time approximation scheme (PTAS) for this problem. Initial work performed at UCSD, supported by NSF grant No. DMS-9206251. Work supported by NSF grant No. CCR-9521606. Work supported by NSF grant No. CCR-9301031.
متن کاملA linear-time approximation scheme for TSP in planar graphs with edge-weights
We give an algorithm requiring O(c 2 n) time to find an -optimal traveling salesman tour in the metric defined by a planar graph with nonnegative edge-lengths.
متن کاملA Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
We give an algorithm requiring O(c1/ǫ 2 n) time to find an ǫ-optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgelengths. For the case of all lengths equal to 1, the time required is O(c1/ǫn).
متن کاملA Hamiltonian Approach to the Assignment of Non-reusable Frequencies
The problem of Radio Labelling is to assign distinct integer labels to all the vertices of a graph, such that adjacent vertices get labels at distance at least two. The objective is to minimize the label span. Radio labelling is a combinatorial model for frequency assignment in case that the transmitters are not allowed to operate at the same channel. We show that radio labelling is related to ...
متن کاملApproximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for coloring within 2 of the optimal chromatic number, which is essentially best possible, and generalizes the seminal result by Thomassen [32] for bounded-genus graphs. This result also improves our understanding from an algori...
متن کامل